Optimal Perimeter Guarding With Heterogeneous Robot Teams: Complexity Analysis and Effective Algorithms
نویسندگان
چکیده
منابع مشابه
Optimal scheduling for replacing perimeter guarding unmanned aerial vehicles
Guarding the perimeter of an area in order to detect potential intruders is an important task in a variety of security-related applications. This task can in many circumstances be performed by a set of camera-equipped unmanned aerial vehicles (UAVs). Such UAVs will occasionally require refueling or recharging, in which case they must temporarily be replaced by other UAVs in order to maintain co...
متن کاملAdaptive heterogeneous multi-robot teams
This research addresses the problem of achieving fault tolerant cooperation within smallto medium-sized teams of heterogeneous mobile robots. We describe a novel behavior-based, fully distributed architecture, called ALLIANCE, that utilizes adaptive action selection to achieve fault tolerant cooperative control in robot missions involving loosely coupled tasks. The robots in this architecture p...
متن کاملCommanding Heterogeneous Multi-Robot Teams
Bolstering up a military unit, e.g., an infantry platoon on a recce mission, by robots often is a double-edged sword. On the one hand, the robots are able to support the soldiers in multiple ways, they can transport bulky equipment, they can enter risky spots, and they may have sensor suits that help to detect dangers of all kinds. On the other hand, robots need to be equipped with energy sourc...
متن کاملPredictive Planning for Heterogeneous Human-Robot Teams
This paper addresses the problem of task allocation over a heterogeneous team of human operators and robotic agents with the object of improving mission efficiency and reducing costs. A distributed systems-level predictive approach is presented which simultaneously plans schedules for the human operators and robotic agents while accounting for agent availability, workload and coordination requi...
متن کاملOptimal Shape Changes for Robot Teams
R 3 for a fixed shape orientation. Using a self-dual IPM solver, we show that optimal solutions for large-scale formations (e.g. thousands of robots) can be computed in less than 1 second using a standard desktop PC. We also investigate the computational complexity of our approach by solving the SOCPs using a logarithmic-barrier (central-path following) method. The most computationally expensiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Robotics and Automation Letters
سال: 2020
ISSN: 2377-3766,2377-3774
DOI: 10.1109/lra.2019.2961302